Motif discovery and motif finding from genome-mapped DNase footprint data
نویسندگان
چکیده
منابع مشابه
Finding regulatory sequences in DNA: motif discovery
The purpose of motif discovery as discussed here is to find binding sites of DNA binding regulators. We assume that the binding sites are short segments of DNA, not necessarily contiguous, to which a specific (family of) transcription factors can bind. While such sites may appear in genic as well as intergenic regions, we focus here on finding binding sites only in the promoter region of each ...
متن کاملBiological sequence motif discovery using motif-x.
The Web-based motif-x program provides a simple interface to extract statistically significant motifs from large data sets, such as MS/MS post-translational modification data and groups of proteins that share a common biological function. Users upload data files and download results using common Web browsers on essentially any Web-compatible computer. Once submitted, data analyses are performed...
متن کاملHigh Resolution Genome Wide Binding Event Finding and Motif Discovery Reveals Transcription Factor Spatial Binding Constraints
An essential component of genome function is the syntax of genomic regulatory elements that determine how diverse transcription factors interact to orchestrate a program of regulatory control. A precise characterization of in vivo spacing constraints between key transcription factors would reveal key aspects of this genomic regulatory language. To discover novel transcription factor spatial bin...
متن کاملMotif Discovery in Heterogeneous Sequence Data
This paper introduces the first integrated algorithm designed to discover novel motifs in heterogeneous sequence data, which is comprised of coregulated genes from a single genome together with the orthologs of these genes from other genomes. Results are presented for regulons in yeasts, worms, and mammals.
متن کاملParallel Network Motif Finding
Network motifs are over-represented patterns within a network, and signify the fundamental building blocks of that network. The process of finding network motifs is closely related to the traditional subgraph isomorphism problem in computer science, which finds instances of a particular subgraph in a graph. This problem has been proven NP-complete, and thus even for relatively small subgraphs a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2009
ISSN: 1460-2059,1367-4803
DOI: 10.1093/bioinformatics/btp434